Comparative Cryptanalysis of Simplified-Data Encryption Standard Using Tabu Search and Simulated Annealing Methods

This paper presents an approach for the comparative cryptanalysis of Simple Data Encryption Standard (S-DES) using Tabu Search and Simulated Annealing methods. In this paper, cipher text only attack is adopted and varieties of optimum keys are generated based on the cost function values. The goal of this paper is three fold. First we want to make a study about how evolutionary computation techniques can efficiently solve the NP-Hard combinatorial problem. For achieving this goal we test several evolutionary computation techniques like Tabu Search algorithm and simulated annealing for the cryptanalysis of simplified data encryption standard problem (SDES). Second was a comparison between Tabu Search algorithm and simulated annealing were made in order to investigate the performance for the cryptanalysis on SDES. The methods were tested and extensive computational results show that Tabu Search algorithm performs better than simulated annealing for such type of NP-Hard combinatorial problem. This paper represents our first effort toward efficient Tabu Search algorithm for the cryptanalysis of SDES. And third was cryptanalysis data could be store for long time with help of Self Monitoring Analysis and Reporting Technology (SMART) Copyback technique.